An Abstract Semantics and Concrete Language for Continuous Queries over Streams and Relations
نویسندگان
چکیده
Despite the recent surge of research in query processing over data streams, little attention has been devoted to defining precise semantics for continuous queries over streams. We first present an abstract semantics based on several building blocks: formal definitions for streams and relations, mappings among them, and any relational query language. From these basics we define a precise interpretation for continuous queries over streams and relations. We then propose a concrete language, CQL (for Continuous Query Language), which instantiates the abstract semantics using SQL as the relational query language and window specifications derived from SQL-99 to map from streams to relations. We identify some equivalences that can be used to rewrite CQL queries for optimization, and we discuss some additional implementation issues arising from the language and its semantics. We have implemented a substantial fraction of CQL in a Data Stream Management System at Stanford, and we have developed a public repository of data stream applications that includes a wide variety of queries expressed in CQL.
منابع مشابه
A Semantics for a Query Language over Sensors, Streams and Relations
We introduce a query language over sensors, streams and relations and formally describe its semantics. Although the language was specifically designed for sensor network querying, where data is pulled into streams, the semantics contributed in the paper also encompasses the case in which data is pushed onto streams or else lies stored in classical relations. The approach taken is that continuou...
متن کاملارائه روشی پویا جهت پاسخ به پرسوجوهای پیوسته تجمّعی اقتضایی
Data Streams are infinite, fast, time-stamp data elements which are received explosively. Generally, these elements need to be processed in an online, real-time way. So, algorithms to process data streams and answer queries on these streams are mostly one-pass. The execution of such algorithms has some challenges such as memory limitation, scheduling, and accuracy of answers. They will be more ...
متن کاملCondensative Stream Query Language for Data Streams
In contrast to traditional database queries, a query on stream data is continuous in that it is periodically evaluated over fractions (sliding windows) of the data stream. This introduces challenges beyond those encountered when processing traditional queries. Over a traditional DBMS (Database Management System), the answer to an aggregate query is usually much smaller than the answer to a simi...
متن کاملA Temporal Foundation for Continuous Queries over Data Streams
Despite the surge of research in continuous stream processing, there is still a semantical gap. In many cases, continuous queries are formulated in an enriched SQL-like query language without specifying the semantics of such a query precisely enough. To overcome this problem, we present a sound and precisely defined temporal operator algebra over data streams ensuring deterministic query result...
متن کاملFully abstract models of programming languages
We present a theory of fully abstract denotational semantics of programming languages. Following initial algebra semantics, syntax is specified by manysorted signatures, and models are universal algebras whose carriers are complete partial orders and operations are continuous. The informal requirement that the meanings of iteration and recursion constructs be least fixed points of appropriate u...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003